Towards a complete FEM-based simulation toolkit on GPUs: Geometric Multigrid solvers
نویسندگان
چکیده
We describe a GPUand multicore-oriented implementation technique for a key component of finite element based simulation toolkits for partial differential equations on unstructured grids: Geometric Multigrid solvers. We use efficient sparse matrix-vector multiplications throughout the solver pipeline: within the coarse-grid solver, smoothers and even grid transfers. Our implementation can handle several lowand high-order finite element spaces in 2D and 3D, and for representative benchmark problems, we achieve close to an order of magnitude speedup on a single GPU over a multithreaded CPU code. In addition we present preliminary results for experiments with strong smoothers for unstructured problems on the GPU, aiming at augmenting numerical and computational efficiency simultaneously.
منابع مشابه
Towards a complete FEM-based simulation toolkit on GPUs: Unstructured Grid Finite Element Geometric Multigrid solvers with strong smoothers based on Sparse Approximate Inverses
We describe our FE-gMG solver, a finite element geometric multigrid approach for problems relying on unstructured grids. We augment our GPUand multicore-oriented implementation technique based on cascades of sparse matrix-vector multiplication by applying strong smoothers. In particular, we employ Sparse Approximate Inverse (SPAI) and Stabilised Approximate Inverse (SAINV) techniques. We focus ...
متن کاملEfficient Finite Element Geometric Multigrid Solvers for Unstructured Grids on GPUs
Fast, robust and efficient multigrid solvers are a key numerical tool in the solution of partial differential equations discretised with finite elements. The vast majority of practical simulation scenarios requires that the underlying grid is unstructured, and that high-order discretisations are used. On the other hand, hardware is quickly evolving towards parallelism and heterogeneity, even wi...
متن کاملCommunication-Avoiding Optimization of Geometric Multigrid on GPUs
Multigrid methods are widely used to accelerate the convergence of iterative solvers for linear systems in a number of different application areas. In this report, we explore communication-avoiding implementations of Geometric Multigrid on Nvidia GPUs. We achieved an overall gain of 1.2x for the whole multigrid algorithm over baseline implementation. We also provide an insight into what future ...
متن کاملPetascale elliptic solvers for anisotropic PDEs on GPU clusters
Memory bound applications such as solvers for large sparse systems of equations remain a challenge for GPUs. Fast solvers should be based on numerically efficient algorithms and implemented such that global memory access is minimised. To solve systems with up to one trillion (10) unknowns the code has to make efficient use of several million individual processor cores on large GPU clusters. We ...
متن کاملMixed-Precision GPU-Multigrid Solvers with Strong Smoothers
• Sparse iterative linear solvers are the most important building block in (implicit) schemes for PDE problems • In FD, FV and FE discretisations • Lots of research on GPUs so far for Krylov subspace methods, ADI approaches and multigrid • But: Limited to simple preconditioners and smoothing operators •Numerically strong smoothers exhibit inherently sequential data dependencies (impossible to p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011